Grammar Index by Induced Suffix Sorting

We propose a new compressed text index built upon grammar compression based on induced suffix sorting [Nunes et al., DCC’18]. show that this exhibits locality sensitive parsing property, which allows us to specify, given pattern P, certain substrings of called cores, are similarly parsed in the whenever these occurrences extensible P. Supported by length m, we can locate all its \(\text {occ}\) T n within \(\mathop {}\mathopen {}{\mathcal {O}}\mathopen {}(m \lg |{\mathcal {S}}| + \text {occ}_C\lg {occ})\) time, where \({\mathcal {S}}\) is set characters and non-terminals, number occurrences, {occ}_C\) chosen core C P right hand side production rules T. Our requires {}(g)\) words space be {}(n)\) time using working space, g sum lengths sides rules. practically evaluate our proposed excels at locating long patterns highly-repetitive texts. implementation available https://github.com/TooruAkagi/GCIS_Index.